Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
Identifieur interne : 004320 ( Main/Exploration ); précédent : 004319; suivant : 004321Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
Auteurs : Christian Urban [Allemagne] ; Bozhi ZhuSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Powerful proof techniques, such as logical relation arguments, have been developed for establishing the strong normalisation property of term- rewriting systems. The first author used such a logical relation argument to establish strong normalising for a cut-elimination procedure in classical logic. He presented a rather complicated, but informal, proof establishing this property. The difficulties in this proof arise from a quite subtle substitution operation, which implements proof transformation that permute cuts over other inference rules. We have formalised this proof in the theorem prover Isabelle/HOL using the Nominal Datatype Package, closely following the informal proof given by the first author in his PhD-thesis. In the process, we identified and resolved a gap in one central lemma and a number of smaller problems in others. We also needed to make one informal definition rigorous. We thus show that the original proof is indeed a proof and that present automated proving technology is adequate for formalising such difficult proofs.
Url:
DOI: 10.1007/978-3-540-70590-1_28
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001D30
- to stream Istex, to step Curation: 001D09
- to stream Istex, to step Checkpoint: 000D48
- to stream Main, to step Merge: 004431
- to stream Main, to step Curation: 004320
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof</title><author><name sortKey="Urban, Christian" sort="Urban, Christian" uniqKey="Urban C" first="Christian" last="Urban">Christian Urban</name></author><author><name sortKey="Zhu, Bozhi" sort="Zhu, Bozhi" uniqKey="Zhu B" first="Bozhi" last="Zhu">Bozhi Zhu</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7DE6865DC02741610E403570E67FBFDF57EB0172</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-70590-1_28</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-710Z9XTM-L/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001D30</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001D30</idno><idno type="wicri:Area/Istex/Curation">001D09</idno><idno type="wicri:Area/Istex/Checkpoint">000D48</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000D48</idno><idno type="wicri:doubleKey">0302-9743:2008:Urban C:revisiting:cut:elimination</idno><idno type="wicri:Area/Main/Merge">004431</idno><idno type="wicri:Area/Main/Curation">004320</idno><idno type="wicri:Area/Main/Exploration">004320</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof</title><author><name sortKey="Urban, Christian" sort="Urban, Christian" uniqKey="Urban C" first="Christian" last="Urban">Christian Urban</name><affiliation wicri:level="4"><orgName type="university">Université Louis-et-Maximilien de Munich</orgName><country>Allemagne</country><placeName><settlement type="city">Munich</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region></placeName></affiliation></author><author><name sortKey="Zhu, Bozhi" sort="Zhu, Bozhi" uniqKey="Zhu B" first="Bozhi" last="Zhu">Bozhi Zhu</name><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Powerful proof techniques, such as logical relation arguments, have been developed for establishing the strong normalisation property of term- rewriting systems. The first author used such a logical relation argument to establish strong normalising for a cut-elimination procedure in classical logic. He presented a rather complicated, but informal, proof establishing this property. The difficulties in this proof arise from a quite subtle substitution operation, which implements proof transformation that permute cuts over other inference rules. We have formalised this proof in the theorem prover Isabelle/HOL using the Nominal Datatype Package, closely following the informal proof given by the first author in his PhD-thesis. In the process, we identified and resolved a gap in one central lemma and a number of smaller problems in others. We also needed to make one informal definition rigorous. We thus show that the original proof is indeed a proof and that present automated proving technology is adequate for formalising such difficult proofs.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Bavière</li><li>District de Haute-Bavière</li></region><settlement><li>Munich</li></settlement><orgName><li>Université Louis-et-Maximilien de Munich</li></orgName></list><tree><noCountry><name sortKey="Zhu, Bozhi" sort="Zhu, Bozhi" uniqKey="Zhu B" first="Bozhi" last="Zhu">Bozhi Zhu</name></noCountry><country name="Allemagne"><region name="Bavière"><name sortKey="Urban, Christian" sort="Urban, Christian" uniqKey="Urban C" first="Christian" last="Urban">Christian Urban</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004320 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004320 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:7DE6865DC02741610E403570E67FBFDF57EB0172
|texte= Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
}}
| This area was generated with Dilib version V0.6.33. |  |